#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

class Array
{
    public :
    int a[6];
    Array *next;
    Array(){next=NULL;}
    void s()
    {
        sort(a,a+6);
    }
    bool operator ==(Array b)
    {
        for(int i=0;i<6;i++) if(a[i]!=b.a[i]) return false;
        return true;
    }
};

Array *head[100100];
void init()
{
    fill(head,head+100100,(Array*)NULL);
}
unsigned int ELFHash(Array t)
{
   unsigned int hash = 0;
   unsigned int x    = 0;
   unsigned int i    = 0;
   for(i = 0; i < 6; i++)
   {
      hash = (hash << 4) + (t.a[i]);
      if((x = hash & 0xF0000000L) != 0)
      {
         hash ^= (x >> 24);
      }
      hash &= ~x;
   }
   return hash%100100;
}

unsigned int getHash(Array t)
{
    int s=0;
    for(int i=0;i<6;i++) s+=t.a[i]*(i+1);
    return s%100100;
}
bool hash(Array &t)
{
    int res=getHash(t);
    for(Array *p=head[res];p;p=p->next) if(*p==t) return false;
    t.next=head[res];head[res]=&t;
    return true;
}
int main()
{
    int n;
    bool same;
    Array t[100100];
    while(cin>>n)
    {
        init();
        same = false;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<6;j++) scanf("%d",&t[i].a[j]);
            t[i].s();
            if(!same)
            {
                if(!hash(t[i])) same = true;
            }
        }
        if(same) cout<<"Twin snowflakes found."<<endl;
        else cout<<"No two snowflakes are alike."<<endl;
    }
    return 0;
}
